Levenshtein distance - PDFSEARCH.IO - Document Search Engine

Levenshtein distance
Results: 76

#	Item
11	Domain Adaptation with Good Edit Similarities: a Sparse Way to deal with Scaling and Rotation Problems in Image Classification Amaury Habrard University of Aix-Marseille Laboratoire d’Informatique Fondamentale UMR CNRS Add to Reading List Source URL: laboratoirehubertcurien.fr Language: English - Date: 2011-11-16 02:20:36 Learning Machine learning Ensemble learning Support vector machine AdaBoost Levenshtein distance Linear classifier Statistics Statistical classification Artificial intelligence
12	Time-Efficient Execution of Bounded Jaro-Winkler Distances Kevin Dreßler and Axel-Cyrille Ngonga Ngomo University of Leipzig AKSW Research Group Augustusplatz 10, 04103 Leipzig Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2014-08-14 04:58:14 Record linkage Information Jaro–Winkler distance Rope Levenshtein distance
13	Algorithms for Historical Record Linkage Marijn Schraagen, Leiden Institute of Advanced Computer Science Leiden University. The university to discover. Add to Reading List Source URL: www.gaenovium.com Language: English - Date: 2014-10-13 06:19:44 Pattern matching Software Information Edit distance Record linkage String metric Diff TRE Linkage Computing Dynamic programming Levenshtein distance
14	A Distance Model for Rhythms Jean-Fran¸ cois Paiement Yves Grandvalet IDIAP Research Institute, Case Postale 592, CH-1920 Martigny, Switzerland Add to Reading List Source URL: bengio.abracadoudou.com Language: English - Date: 2008-06-27 10:33:55 Dynamic programming Bioinformatics Estimation theory Hidden Markov model Machine learning Levenshtein distance Expectation–maximization algorithm Mixture model Statistics Probability and statistics Markov models
15	A Generative Model for Rhythms Yves Grandvalet CNRS Add to Reading List Source URL: bengio.abracadoudou.com Language: English - Date: 2007-11-01 18:56:14 Markov models Estimation theory Bioinformatics Hidden Markov model Levenshtein distance Expectation–maximization algorithm Cross-validation Mixture model Statistics Machine learning Dynamic programming
16	Algorithms Lecture 5: Dynamic Programming [Fa’14] Those who cannot remember the past are doomed to repeat it. — George Santayana, The Life of Reason, Book I: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:26 Dynamic programming Mathematical logic Operations research Programming idioms Algorithm Levenshtein distance Recursion Longest increasing subsequence Fibonacci number Mathematics Applied mathematics Theoretical computer science
17	A Generative Model for Rhythms Yves Grandvalet CNRS Add to Reading List Source URL: bengio.abracadoudou.com Language: English - Date: 2007-11-01 18:56:14 Markov models Estimation theory Bioinformatics Hidden Markov model Levenshtein distance Expectation–maximization algorithm Cross-validation Mixture model Statistics Machine learning Dynamic programming
18	Faster Secure Two-Party Computation Using Garbled Circuits Yan Huang David Evans University of Virginia Add to Reading List Source URL: www.usenix.org Language: English - Date: 2011-06-09 13:31:32 Computational complexity theory Logic gates Circuit complexity Secure multi-party computation Levenshtein distance XOR gate Boolean circuit Circuit Adder Theoretical computer science Applied mathematics Cryptographic protocols
19	A linear-time algorithm for comparing similar ordered trees H´el`ene Touzet LIFL – University of Lille 1 – France Comparison with k errors Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:24:06 Tree Spanning tree NP-complete problems Levenshtein distance Graph theory Theoretical computer science Mathematics
20	Report on CPM 2003 14th Annual Symposium on Combinatorial Pattern Matching Morelia, Michoac´an, Mexico, June 25–27, 2003 Gabriel Valiente, Technical University of Catalonia, Barcelona, Spain The 14th Annual Symposium Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2003-07-14 13:04:24 Pattern matching Arrays Suffix array Dynamic programming Suffix tree Approximate string matching String searching algorithm Edit distance Vladimir Levenshtein String Computer programming Computing